genetic and improved shuffled frog leaping algorithms for a 2-stage model of a hub covering location network

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) through special facilities or transshipment points called hubs. in this paper, we consider a central mine and a number of hubs (e.g., factories) connected to a number of nodes (e.g., shops or customers) in a network. first, the hub network is designed, then, a raw materials transportation from a central mine to the hubs (i.e., factories) is scheduled. in this case, we consider only one transportation system regarded as single machine scheduling. furthermore, we use this hub network to solve the scheduling model. in this paper, we consider the capacitated single allocation hub covering location problem (csahclp) and then present the mixed-integer programming (mip) model. due to the computational complexity of the resulted models, we also propose two improved meta-heuristic algorithms, namely a genetic algorithm and a shuffled frog leaping algorithm in order to find a near-optimal solution of the given problem. the performance of the solutions found by the foregoing proposed algorithms is compared with exact solutions of the mathematical programming model .